Geometric folding algorithms - linkages, origami, polyhedra
نویسندگان
چکیده
Follow up what we will offer in this article about geometric folding algorithms linkages origami polyhedra. You know really that this book is coming as the best seller book today. So, when you are really a good reader or you're fans of the author, it does will be funny if you don't have this book. It means that you have to get this book. For you who are starting to learn about something new and feel curious about this book, it's easy then. Just get this book and feel how this book will give you more exciting lessons.
منابع مشابه
On Folding a Polygon to a Polyhedron
We show that the open problem presented in Geometric Folding Algorithms: Linkages, Origami, Polyhedra [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.
متن کاملOrigami, Linkages, and Polyhedra: Folding with Algorithms
What forms of origami can be designed automatically by algorithms? What shapes can result by folding a piece of paper flat and making one complete straight cut? What polyhedra can be cut along their surface and unfolded into a flat piece of paper without overlap? When can a linkage of rigid bars be untangled or folded into a desired configuration? Folding and unfolding is a branch of discrete a...
متن کاملOn Folding and Unfolding with Linkages and Origami
We revisit foundational questions in the kinetic theory of linkages and origami, investigating their folding/unfolding behaviors and the computational complexity thereof. In Chapter 2, we exactly settle the complexity of realizability, rigidity, and global rigidy for graphs and linkages in the plane, even when the graphs are (1) promised to avoid crossings in all configurations, or (2) equilate...
متن کاملPlanar Drawings of Origami Polyhedra
This work studies the structure of origami bases via graph drawings of origami polyhedra. In particular, we propose a new class of polyhedra, called extreme-base polyhedra, that capture the essence of \extreme" origami bases. We develop a linear-time algorithm to nd the \natural" straight-line planar drawing of these polyhedra. This algorithm demonstrates a recursive structure in the polyhedra ...
متن کاملLang, Origami and Geometric Constructions Origami and Geometric Constructions 1 Bringing a Point to a Point Bringing a Point onto a Line ( Bringing One Line to Another Line ( Lang, Origami and Geometric Constructions Introduction
By Robert J. Lang Copyright ©1996–2010. All rights reserved. Introduction................................................................................................................................... 3 Preliminaries and Definitions ...................................................................................................... 3 Binary Divisions .........................................
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007